Maximal independent set - PDFSEARCH.IO - Document Search Engine

Maximal independent set
Results: 70

#	Item
11	Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems Karl Bringmann1 , Christian Engels2 , Bodo Manthey3 , B. V. Raghavendra Rao4 1 Max Planck Institute for Informatics, .d Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:46:12 Graph theory Mathematics Computational complexity theory NP-complete problems Combinatorial optimization NP-hard problems Approximation algorithms Edsger W. Dijkstra Travelling salesman problem Nearest neighbour algorithm Shortest path problem Maximal independent set
12	Geometric Ad-Hoc Routing: Of Theory and Practice Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:48 Graph theory Mathematics Graph coloring Maximal independent set
13	CS264: Beyond Worst-Case Analysis Lecture #10: Planted and Semi-Random Graph Models∗ Tim Roughgarden† October 22, Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2015-01-05 12:59:35 Graph theory Computational complexity theory Mathematics NP-complete problems Clique problem Planted clique Graph partition Graph coloring Clique Time complexity Maximal independent set Pathwidth
14	i i “imvol3” — — 15:41 — page 445 — #1 i Add to Reading List Source URL: www.cs.uoi.gr Language: English - Date: 2008-03-31 06:45:00 Graph theory Random walk PageRank Matrix Maximal independent set Trapezoid graph
15	Brief Announcement: Local Approximability of Minimum Dominating Set on Planar Graphs Miikka Hilke Christoph Lenzen Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2015-05-29 10:12:03 Graph theory NP-complete problems Combinatorial optimization Planar graphs Dominating set Matching Graph coloring Maximal independent set
16	On the Parameterized Complexity for Token Jumping on Graphs Takehiro Ito1 , Marcin Kami´ nski2 , Hirotaka Ono3 , 1 4 Add to Reading List Source URL: rutcor.rutgers.edu Language: English - Date: 2014-04-14 14:04:38 NP-complete problems Graph theory Network theory Edsger W. Dijkstra Shortest path problem Maximal independent set Independent set Matching Bipartite graph Degree Graph Line graph
17	Brief Announcement: Efficient Graph Algorithms without Synchronization Johannes Schneider Roger Wattenhofer Add to Reading List Source URL: disco.ethz.ch Language: English - Date: 2014-09-26 08:36:28 Graph coloring Combinatorial optimization Distributed computing Matching Maximal independent set Edge coloring
18	Maximal Strip Recovery Problem with Gaps: Hardness and Approximation AlgorithmsI Laurent Bulteau, Guillaume Fertin, Irena Rusu Laboratoire d’Informatique de Nantes-Atlantique (LINA), UMR CNRS 6241 Université de Nantes Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2013-01-07 10:28:20 Computational problems NP-complete problems Optimization problem Synteny Independent set
19	Tight Bounds for Distributed Selection Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich, Switzerland Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2015-05-18 12:16:23 Analysis of algorithms Probabilistic complexity theory Randomized algorithm Selection algorithm B-tree Oblivious data structure Maximal independent set
20	CS264: Beyond Worst-Case Analysis Lecture #5: Computing Independent Sets: A Parameterized Analysis ∗ Tim Roughgarden† October 8, 2014 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-11-02 12:35:58 NP-complete problems Approximation algorithm Independent set Algorithm Maximal independent set Longest path problem Vertex cover

UPDATE